Induced subgraphs of Johnson graphs
نویسندگان
چکیده
منابع مشابه
Induced Subgraphs of Johnson Graphs
The Johnson graph J(n, N) is defined as the graph whose vertices are the n-subsets of the set {1, 2, · · · , N}, where two vertices are adjacent if they share exactly n− 1 elements. Unlike Johnson graphs, induced subgraphs of Johnson graphs (JIS for short) do not seem to have been studied before. We give some necessary conditions and some sufficient conditions for a graph to be JIS, including: ...
متن کاملExcluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with chromatic number k + 1 almost all graphs not containing H as a subgraph are k-colorable if and only if H contains a color-critical edge. We strengthen the concept of H-free to induced subgraph containment, proving that...
متن کاملPartitioning Graphs into Induced Subgraphs
We study the parametrized complexity of the Partition into Triangles problem. For this problem a (simple) graph with 3n vertices is given and the question is whether it is possible to cover its vertices with n triangles (complete graphs on 3 vertices). We prove that there is an FPT algorithm that decides the Partition into Triangles problem and that the existence of a polynomial size kernel is ...
متن کاملSizes of Induced Subgraphs of Ramsey Graphs
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of size greater than c log n. Erdős, Faudree and Sós conjectured that every c-Ramsey graph with n vertices contains Ω(n5/2) induced subgraphs any two of which differ either in the number of vertices or in the number of edges, i.e. the number of distinct pairs (|V (H)|, |E(H)|), as H ranges over all i...
متن کاملPlanar Induced Subgraphs of Sparse Graphs
We show that every graph has an induced pseudoforest of at least n− m/4.5 vertices, an induced partial 2-tree of at least n−m/5 vertices, and an induced planar subgraph of at least n−m/5.2174 vertices. These results are constructive, implying linear-time algorithms to find the respective induced subgraphs. We also show that the size of the largest Kh-minorfree graph in a given graph can sometim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2012
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2012.5.25